Deterministic algorithms for multi-criteria Max-TSP
نویسندگان
چکیده
منابع مشابه
Deterministic algorithms for multi-criteria Max-TSP
We present deterministic approximation algorithms for the multi-criteria maximum traveling salesman problem (Max-TSP). Our algorithms are faster and simpler than the existing randomized algorithms. We devise algorithms for the symmetric and asymmetric multi-criteria Max-TSP that achieve ratios of 1/2k−ε and 1/(4k−2)−ε, respectively, where k is the number of objective functions. For two objectiv...
متن کاملDeterministic Algorithms for Multi-criteria TSP
We present deterministic approximation algorithms for the multi-criteria traveling salesman problem (TSP). Our algorithms are faster and simpler than the existing randomized algorithms. First, we devise algorithms for the symmetric and asymmetric multicriteria Max-TSP that achieve ratios of 1/2k − ε and 1/(4k − 2) − ε, respectively, where k is the number of objective functions. For two objectiv...
متن کاملImproved deterministic approximation algorithms for Max TSP
We present an O(n)-time approximation algorithm for the maximum traveling salesman problem whose approximation ratio is asymptotically 61 81 , where n is the number of vertices in the input complete edge-weighted (undirected) graph. We also present an O(n)-time approximation algorithm for the metric case of the problem whose approximation ratio is asymptotically 17 20 . Both algorithms improve ...
متن کاملApproximating Multi-criteria Max-TSP
The traveling salesman problem (TSP) is one of the most fundamental problems in combinatorial optimization. Given a graph, the goal is to find a Hamiltonian cycle of minimum or maximum weight. We consider finding Hamiltonian cycles of maximum weight (Max-TSP). An instance of Max-TSP is a complete graph G = (V,E) with edge weights w : E → N. The goal is to find a Hamiltonian cycle of maximum wei...
متن کاملMulti-Criteria TSP: Min and Max Combined
We present randomized approximation algorithms for multicriteria traveling salesman problems (TSP), where some objective functions should be minimized while others should be maximized. For the symmetric multi-criteria TSP (STSP), we present an algorithm that computes (2/3−ε, 4+ε) approximate Pareto curves. Here, the first parameter is the approximation ratio for the objectives that should be ma...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2012
ISSN: 0166-218X
DOI: 10.1016/j.dam.2012.05.007